A memetic algorithm for the inventory routing problem

In this article, we study an Inventory Routing Problem with deterministic customer demand in a two-tier supply chain. The chain network consists of supplier using single vehicle given capacity to deliver product type multiple customers. We are interested population-based algorithms solve our problem. A Memetic Algorithm (MA) is developed based on the Genetic (GA) and Variable Neighborhood Search methods. proposed meta-heuristics tested small large reference benchmarks. results MA compared those classical GA optimal solutions literature. comparison shows efficiency its ability generate high quality reasonable computation time.